Number of Odd Binomial Coefficients
نویسندگان
چکیده
منابع مشابه
Geometry of Binomial Coefficients
This note describes the geometrical pattern of zeroes and ones obtained by reducing modulo two each element of Pascal's triangle formed from binomial coefficients. When an infinite number of rows of Pascal's triangle are included, the limiting pattern is found to be "self-similar," and is characterized by a "fractal dimension" log2 3. Analysis of the pattern provides a simple derivation of the ...
متن کاملPlanar Binomial Coefficients
The notion of binomial coefficients (T S ) of finite planar, reduced rooted trees T, S is defined and a recursive formula for its computation is shown. The nonassociative binomial formula (1 + x) = ∑
متن کاملOn Sums of Binomial Coefficients
In this paper we study recurrences concerning the combinatorial sum [n r ] m = ∑ k≡r (mod m) (n k ) and the alternate sum ∑ k≡r (mod m)(−1) (n k ) , where m > 0, n > 0 and r are integers. For example, we show that if n > m−1 then b(m−1)/2c ∑ i=0 (−1) (m− 1− i i )[n− 2i r − i ]
متن کاملModular Periodicity of Binomial Coefficients
We prove that if the signed binomial coefficient (−1) ` k i ́ viewed modulo p is a periodic function of i with period h in the range 0 ≤ i ≤ k, then k + 1 is a power of p, provided h is prime to p and not too large compared to k. (In particular, 2h ≤ k suffices.) As an application, we prove that if G and H are multiplicative subgroups of a finite field, with H < G, and such that 1− α ∈ G for all...
متن کاملOn the Conditioned Binomial Coefficients
We answer a question on the conditioned binomial coefficients raised in and article of Barlotti and Pannone, thus giving an alternative proof of an extension of Frobenius’ generalization of Sylow’s theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1977
ISSN: 0002-9939
DOI: 10.2307/2041936